An Automatic Portrait System Based on And-Or Graph Representation

نویسندگان

  • Feng Min
  • Jin-Li Suo
  • Song-Chun Zhu
  • Nong Sang
چکیده

In this paper, we present an automatic human portrait system based on the And-Or graph representation. The system can automatically generate a set of life-like portraits in different styles from a frontal face image. The system includes three subsystems, each of which models hair, face and collar respectively. The face subsystem can be further decomposed into face components: eyebrows, eyes, nose, mouth, and face contour. Each component has a number of distinct sub-templates as a leaf-node in the And-Or graph for portrait. The And-Or graph for portrait is like a ”mother template” which produces a large set of valid portrait configurations, which is a ”composite templates” made of a set of sub-templates. Our approach has three novel aspects:(1) we present an And-Or graph for portrait that explains the hierarchical structure and variability of portrait and apply it into practice; (2) we combine hair, face and collar into a system that solves a practical problem; (3) The system can simultaneously generate a set of impressive portraits in different styles. Experimental results demonstrate the effectiveness and lifelikeness of our approach.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic Hashtag Recommendation in Social Networking and Microblogging Platforms Using a Knowledge-Intensive Content-based Approach

In social networking/microblogging environments, #tag is often used for categorizing messages and marking their key points. Also, since some social networks such as twitter apply restrictions on the number of characters in messages, #tags can serve as a useful tool for helping users express their messages. In this paper, a new knowledge-intensive content-based #tag recommendation system is intr...

متن کامل

dominating subset and representation graph on topological spaces

Let a topological space. An intersection graph on a topological space , which denoted by ‎ , is an undirected graph which whose vertices are open subsets of and two vertices are adjacent if the intersection of them are nonempty. In this paper, the relation between topological properties of  and graph properties of ‎  are investigated. Also some classifications and representations for the graph ...

متن کامل

Video-based face recognition in color space by graph-based discriminant analysis

Video-based face recognition has attracted significant attention in many applications such as media technology, network security, human-machine interfaces, and automatic access control system in the past decade. The usual way for face recognition is based upon the grayscale image produced by combining the three color component images. In this work, we consider grayscale image as well as color s...

متن کامل

The Female gaze in proportion to pictorial elements in "A parrot with fruit and a portrait of a girl"

Qajar painting influenced Iran’s painting with a new kind of illustrations originating from the past traditions. Art and cultural politics of Fath Ali Shah performs an obvious role amongst the influential agents and historical events in the era of Qajar paintings for a presentation of the concepts of power in the social, political and cultural arena. Fath Ali Shah’s patronage of the art alters ...

متن کامل

Epileptic seizure detection based on The Limited Penetrable visibility graph algorithm and graph properties

Introduction: Epileptic seizure detection is a key step for both researchers and epilepsy specialists for epilepsy assessment due to the non-stationariness and chaos in the electroencephalogram (EEG) signals. Current research is directed toward the development of an efficient method for epilepsy or seizure detection based the limited penetrable visibility graph (LPVG) algorith...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007